Spanning tree modulus for secure broadcast games
نویسندگان
چکیده
منابع مشابه
Three Selfish Spanning Tree Games
We study a problem in a network. The input is an edgeweighted graph G = (V, E) such that V contains a specific source node r. Every v ∈ V \{r} is an entity which wants to be connected to r either directly or via other entities. The main question is how do the entities deviate from a socially optimal network if they are not monitored by a central authority. We provide theoretical bounds on the (...
متن کاملMulti-criteria minimum cost spanning tree games
The minimum cost spanning tree game (mcst-game) is a well-known model within operations research games that has been widely studied in the literature. In this paper we introduce the multi-criteria version of the mcst-game as a setvalued TU-game. We prove that the extension of Bird s cost allocation rule provides dominance core elements in this game. We also give a family of core solutions that ...
متن کاملSubmodularity of minimum-cost spanning tree games
We give a necessary condition and a sufficient condition for a minimum-cost spanning tree game introduced by Bird to be submodular (or convex). When the cost is restricted to two values, we give a characterization of submodular minimum-cost spanning tree games. We also discuss algorithmic issues.
متن کاملCost monotonicity, consistency and minimum cost spanning tree games
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core selection and also satis...es cost monotonicity. We also give characterization theorems for the new rule as well as the much-studied Bird allocation. We show that the principal di¤erence between these two rules is in terms of their consistency properties. JEL Classi...cation Numbers: D7
متن کاملOn the Different Forms of Spanning Tree-based Broadcast Topologies for Mobile Ad hoc Networks
In this paper, we study the different forms of spanning tree-based topologies that could be used for efficient broadcasting in mobile ad hoc networks (MANETs). In this context, we consider the minimum distance-based, predicted link expiration time-based and the minimum velocity-based broadcast topologies, respectively referred to as MD-BT, LET-BT and MV-BT. The LET and minimum velocitybased bro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2020
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.21945